The interpretability logic ILF ∗
نویسندگان
چکیده
In this paper we determine a characteristic class of ILsetframes for the principle F. Then we prove that the principle P is not provable in the system ILF. We use a generalized Veltman model.
منابع مشابه
A note on normal forms for the closed fragment of system IL
In [8], P. Hájek and V. Švejdar determined normal forms for the system ILF, and showed that we can eliminate the modal operator ¤ from IL–formulas. The normal form for the closed fragment of the interpretability logic IL is an open problem (see [13]). We prove that in some cases we can eliminate the modal operator ¤. We give an example where it is impossible to eliminate ¤. AMS subject classifi...
متن کاملGeneralized Veltman models with a root
Provability logic is a nonstandard modal logic. Interpretability logic is an extension of provability logic. Generalized Veltman models are Kripke like semantics for interpretability logic. We consider generalized Veltman models with a root, i.e. r-validity, r-satisfiability and a consequence relation. We modify Fine’s and Rautenberg’s proof and prove non–compactness of interpretability logic.
متن کاملBisimulation quotients of Veltman models
Interpretability logic is a modal description of the interpretability predicate. The modal system IL is an extension of the provability logic GL (Gödel–Löb). Bisimulation quotients and largest bisimulations have been well studied for Kripke models. We examine interpretability logic and consider how these results extend to Veltman models. REPORTS ON MATHEMATICAL LOGIC 40 (2006), 59–73 Domagoj VR...
متن کاملInterpretability over Peano Arithmetic
We investigate the modal logic of interpretability over Peano arith metic PA Our main result is an extension of the arithmetical complete ness theorem for the interpretability logic ILM This extension concerns recursively enumerable sets of formulas of interpretability logic rather than single formulas As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability...
متن کاملUnary Interpretability Logic
Let T be an arithmetical theory. We introduce a unary modal operator T to be interpreted arithmetically as the unary interpretability predicate over T. We present complete axiomatizations of the (unary) interpretability principles underlying two important classes of theories. We also prove some basic modal results about these new axiomatizations.
متن کامل